Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at the origin (0, 0) on a 2D plane and walk on the path specified by path.
Return True if the path crosses itself at any point, that is, if at any time you are on a location you've previously visited. Return False otherwise.
Input: path = "NES" Output: false Explanation: Notice that the path doesn't cross any point more than once.
Input: path = "NESWW" Output: true Explanation: Notice that the path visits the origin twice.
1 <= path.length <= 10^4pathwill only consist of characters in{'N', 'S', 'E', 'W}
use std::collections::HashSet;implSolution{pubfnis_path_crossing(path:String) -> bool{letmut visited = HashSet::new();letmut x = 0;letmut y = 0; visited.insert((x, y));for dir in path.bytes(){match dir {b'N' => y += 1,b'S' => y -= 1,b'E' => x += 1, _ => x -= 1,};if !visited.insert((x, y)){returntrue;}}false}}